Administering Event Reporting Rules In A Distributed Processing System

ABSTRACT

Methods, systems and products are provided for administering event reporting rules in a distributed processing system that includes identifying that one or more nodes of the distributed processing system is idle; for each identified idle node, collecting by the idle node any suppressed events and logged data from the node; sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The field of the invention is data processing, or, more specifically, methods, systems, and products for relevant alert delivery, dynamic administration of component event reporting in a distributed processing system, and administering event reporting rules in a distributed processing system.

2. Description of Related Art

The development of the EDVAC computer system of 1948 is often cited as the beginning of the computer era. Since that time, computer systems have evolved into extremely complicated devices. Today's computers are much more sophisticated than early systems such as the EDVAC. Computer systems typically include a combination of hardware and software components, application programs, operating systems, processors, buses, memory, input/output devices, and so on. As advances in semiconductor processing and computer architecture push the performance of the computer higher and higher, more sophisticated computer software has evolved to take advantage of the higher performance of the hardware, resulting in computer systems today that are much more powerful than just a few years ago.

Modern distributed processing systems for intensive computing may have millions of devices with many processes running on each device all of which are capable of error and status reporting for automated error recovery, reporting to a systems administrator, and for other reasons. In many cases, in the case of an error for example, the sheer number of such error reports and status reports are so overwhelming that they cannot be handled in a meaningful manner. For example, a systems administrator receiving a hundred thousand error reports may be overwhelmed by the sheer number of such reports and therefore in the aggregate those reports become more and more unhelpful and irrelevant.

SUMMARY OF THE INVENTION

Methods, systems and products are provided for administering event reporting rules in a distributed processing system that includes identifying that one or more nodes of the distributed processing system is idle; for each identified idle node, collecting by the idle node any suppressed events and logged data from the node; sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data.

The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an exemplary system for relevant alert delivery with event and alert suppression in a distributed processing system according to embodiments of the present invention.

FIG. 2 sets forth a block diagram of automated computing machinery comprising an exemplary computer useful in relevant alert delivery with event and alert suppression according to embodiments of the present invention.

FIG. 3 sets forth a block diagram of an exemplary system for relevant alert delivery with event and alert suppression in a distributed processing system according to embodiments of the present invention.

FIG. 4 sets forth a diagram illustrating assigning events to an event pool according to embodiments of the present invention.

FIG. 5 sets forth a diagram illustrating assigning alerts to an alert pool according to embodiments of the present invention.

FIG. 6 sets forth a flow chart illustrating an example method of relevant alert delivery with event and alert suppression according to embodiments of the present invention.

FIG. 7 sets forth a flow chart illustrating an example method of dynamic administration of component event reporting in a distributed processing system according to embodiments of the present invention.

FIG. 8 sets forth a flow chart illustrating an additional method of dynamic administration of component event reporting in a distributed processing system according to embodiments of the present invention.

FIG. 9 sets forth a flow chart illustrating an additional method of dynamic administration of component event reporting in a distributed processing system according to embodiments of the present invention.

FIG. 10 sets forth a flow chart illustrating a method of administering event reporting rules in a distributed processing system according to embodiments of the present invention.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Exemplary methods, systems, and computer program products for relevant alert delivery, dynamic administration of component event reporting in a distributed processing system, and administering event reporting rules in a distributed processing system according to embodiments of the present invention, beginning with FIG. 1. FIG. 1 illustrates an exemplary system for relevant alert delivery and dynamic administration of component event reporting in a distributed processing system according to embodiments of the present invention. A distributed processing system is typically implemented as multiple autonomous or semi-autonomous computers that communicate through a computer network. In such example distributed processing systems, the computers often interact with each other in order to achieve a common goal. A computer program that runs in such an example distributed system is typically called a distributed program, and distributed programming is often used to describe the process of writing such programs.

In the example of FIG. 1, the distributed processing system (101) is implemented as a parallel computer (100), non-volatile memory for the computer in the form of data storage device (118), an output device for the computer in the form of printer (120), and an input/output device for the computer in the form of computer terminal (122). The parallel computer (100) in the example of FIG. 1 also includes a plurality of compute nodes (102). Each compute node is an automated computing device composed of one or more computer processors, its own computer memory, and its own input/output functionality.

The compute nodes (102) are coupled for data communications by several independent data communications networks including a high speed Ethernet network (174), a Joint Test Action Group (‘JTAG’) network (104), a tree network (106) which is optimized for collective operations, and a torus network (108) which is optimized for point to point operations. Tree network (106) is a data communications network that includes data communications links connected to the compute nodes so as to organize the compute nodes as a tree. Each data communications network is implemented with data communications links among the compute nodes (102). The data communications links provide data communications for parallel operations among the compute nodes of the parallel computer.

In addition to compute nodes, computer (100) includes input/output (‘I/O’) nodes (110, 114) coupled to compute nodes (102) through one of the data communications networks (174). The I/O nodes (110, 114) provide I/O services between compute nodes (102) and I/O devices (118, 120, 122). I/O nodes (110, 114) are connected for data communications I/O devices (118, 120, 122) through local area network (‘LAN’) (130). Computer (100) also includes a service node (116) coupled to the compute nodes through one of the networks (104). Service node (116) provides service common to pluralities of compute nodes, loading programs into the compute nodes, starting program execution on the compute nodes, retrieving results of program operations on the computer nodes, and so on. Service node (116) runs a service application (124) and communicates with users (128) through a service application interface (126) that runs on computer terminal (122).

Many of the components of the distributed processing system of FIG. 1, that is the devices of the distributed processing system or processes running on the devices of the distributed processing system of FIG. 1 are capable of some form of error or status reporting through events and many of such components are also capable of receiving alerts in response to one or more of such events. Often in distributed processing systems useful according to embodiments of the present invention hundreds of thousands or millions of components may provide events or receive alerts.

Each of the compute nodes of FIG. 1, for example, have installed upon them an event reporting module (800). The event reporting module (800) is implemented as a module of automated computing machinery capable of reporting events to the event and alert analysis module (124). Each event reporting module has installed upon it local event reporting rules dictating particular events to be reported for particular conditions on the component. Such conditions may include errors occurring on the component, status of aspects of the component and others as will occur to those of skill in the art. Each such condition may have a particular event associated with and event reporting rules dictate which events are to be reported for which conditions occurring on the component. While only one event reporting module (800) is illustrated in FIG. 1, those of skill in the art will recognize that many of the components of the distributed processing system of FIG. 1 may support an event reporting module capable of reporting events to the event and alert analysis module.

The event reporting module (800) of FIG. 1 is also capable of administering event reporting rules in a distributed processing system by identifying that one or more nodes of the distributed processing system is idle; and for each identified idle node, collecting by the idle node any suppressed events and logged data from the node; sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data.

The service node (116) of FIG. 1 has installed upon it an event and alert analysis module (124) capable of relevant alert delivery with event and alert suppression in a distributed processing system according to embodiments of the present invention. The event and alert analysis module (124) of FIG. 1 is implemented as automated computing machinery capable of receiving in an event queue a plurality of events from one or more components of a distributed processing system; assigning by an event analyzer each received event to an events pool; wherein the event analyzer includes event analysis rules including, event arrival rules, events pool operation rules, event suppression rules, and events pool closure rules; identifying by the event analyzer in dependence upon the event arrival rules and the events assigned to the events pool one or more alerts; closing, by the event analyzer in dependence upon the events pool operation rules, the events pool; determining, by the events analyzer in dependence upon the event suppression rules, whether to suppress one or more events in the closed events pool; and identifying by the event analyzer in dependence upon the events pool closure rules and any unsuppressed events assigned to the events pool, one or more additional alerts; sending by the event analyzer to an alert analyzer all the alerts identified by the event analyzer; assigning by the alert analyzer the identified alerts to an alerts pool; determining by the alert analyzer in dependence upon alert analysis rules and the alerts in the alert pool whether to suppress any alerts; and transmitting the unsuppressed alerts to one or more components of the distributed processing system.

In some embodiments the unsuppressed alerts are transmitted to one or more components of the distributed processing system. One such component may be a terminal (122) for display to a systems administrator. Other components may include a component that generated an event, a component for error reporting, a component for automated error recovery or any other component that will occur to those of skill in the art.

The event and alert module (124) of FIG. 1 allows the number of events received and alerts produced at any given time to be less overwhelming to a systems administrator (128) attempting to identify a problem or occurrence in the distributed processing system. Relevant alert delivery with event and alert suppression according to embodiments of the present invention provides alerts that are more meaningful to a user in determining how to administer the functions and errors associated with a distributed processing system.

As mentioned above, each component of the distributed processing system may report events based upon event reporting rules. In the example of FIG. 1, the event and alert analysis module (124) is capable of dynamic administration of component event reporting in a distributed processing system by receiving, by an events analyzer from an events queue, a plurality of events from one or more components of the distributed processing system; determining, by the events analyzer in dependence upon the received events and one or more event analysis rules, to change the event reporting rules of one or more components; and instructing, by the events analyzer, the one or more components to change the event reporting rules. The components receiving the instruction are then capable of receiving the instruction to change the event reporting rules and changing the event reporting rules in accordance with the instruction.

The event and alert analysis module (124) is also capable of identifying that a node is idle and instructing the idle node to collect any suppressed events and logged data from the node and send the suppressed events and logged data to the event and alert analysis module. The and alert analysis module (124) is also capable of identifying new event reporting rules for the idle node from events and logged data in a database sent from an idle node and instructing by the events analyzer the idle node to change the event reporting rules for one or more components on the node.

The arrangement of nodes, networks, and I/O devices making up the exemplary distributed processing system illustrated in FIG. 1 are for explanation only, not for limitation of the present invention. Distributed data processing systems capable of relevant alert delivery and dynamic administration of component event reporting according to embodiments of the present invention may include additional nodes, networks, devices, and architectures, not shown in FIG. 1, as will occur to those of skill in the art. The parallel computer (100) in the example of FIG. 1 includes sixteen compute nodes (102); parallel computers capable of relevant alert delivery according to embodiments of the present invention sometimes include thousands of compute nodes. In addition to Ethernet and JTAG, networks in such data processing systems may support many data communications protocols including for example TCP (Transmission Control Protocol), IP (Internet Protocol), and others as will occur to those of skill in the art. Various embodiments of the present invention may be implemented on a variety of hardware platforms in addition to those illustrated in FIG. 1.

Relevant alert delivery with event and alert suppression, dynamic administration of component event reporting in a distributed processing system, and administering event reporting rules in a distributed processing system in accordance with the present invention is generally implemented with computers, that is, with automated computing machinery. In the system of FIG. 1, for example, all the service nodes, I/O nodes, compute nodes, of the parallel computer are implemented to some extent at least as computers. For further explanation, therefore, FIG. 2 sets forth a block diagram of automated computing machinery comprising an exemplary computer (152) useful in relevant alert delivery according to embodiments of the present invention. The computer (152) of FIG. 2 includes at least one computer processor (156) or ‘CPU’ as well as random access memory (168) (‘RAM’) which is connected through a high speed memory bus (166) and bus adapter (158) to processor (156) and to other components of the computer (152) and through an expansion bus to adapters for communications with other components of a distributed processing system (101).

Stored in RAM (168) is an event and alert analysis module (124), a module of automated computing machinery for relevant alert delivery according to embodiments of the present invention. The event and alert analysis module (124) includes an event analyzer (208) and an alert analyzer (218). The event analyzer of FIG. 2 is a module of automated computing machinery capable of identifying alerts in dependence upon received events. That is, event analyzers typically receive events and produce alerts. In many embodiments, a plurality of event analyzers are implemented in parallel. Often such event analyzers are assigned to a particular pool of events and may be focused on events from a particular component or caused by a particular occurrence to produce a more concise set of alerts.

The alert analyzer of FIG. 2 is a module of automated computing machinery capable of identifying alerts for transmission from events and other alerts, identifying additional alerts for transmission, and suppressing unnecessary, irrelevant, or otherwise unwanted alerts identified by the event analyzer. That is, alert analyzers typically receive alerts and events and produce or forward alerts in dependence upon those alerts and events. In many embodiments, a plurality of alert analyzers are implemented in parallel. Often such alert analyzers are assigned to a particular pool of alerts and may be focused on alerts with particular attributes to produce a more concise set of alerts.

The event and alert analysis module (124) of FIG. 2 includes computer program instructions for receiving in an event queue a plurality of events from one or more components (for example, 100, 182, 181, 180, and 170) of a distributed processing system (101); assigning by the event analyzer (208) each received event to an events pool; identifying by the event analyzer (208) in dependence upon the event arrival rules and the events assigned to the events pool one or more alerts; closing, by the event analyzer (208) in dependence upon the events pool operation rules, the events pool; determining, by the events analyzer (208) in dependence upon the event suppression rules, whether to suppress one or more events in the closed events pool; identifying by the event analyzer (208) in dependence upon the events pool closure rules and any unsuppressed events assigned to the events pool, one or more additional alerts; sending by the event analyzer (208) to the alert analyzer (218) all the alerts identified by the event analyzer; assigning by the alert analyzer (218) the identified alerts to an alerts pool; determining by the alert analyzer (218) in dependence upon alert analysis rules and the alerts in the alert pool whether to suppress any alerts; and transmitting (420) the unsuppressed alerts to one or more components of the distributed processing system.

The event and alert analysis module (124) of FIG. 2 includes computer program instructions for dynamic administration of component event reporting in a distributed processing system including computer program instructions for receiving, by an events analyzer (208) from an events queue, a plurality of events from one or more components of the distributed processing system; determining, by the events analyzer (208) in dependence upon the received events and one or more event analysis rules, to change the event reporting rules of one or more components; and instructing, by the events analyzer (208), the one or more components to change the event reporting rules.

The event and alert analysis module (124) of FIG. 2 includes computer program instructions for identifying that one or more nodes of the distributed processing system is idle; instructing the idle node to collect any suppressed events and logged data from the node; identifying in dependence upon the suppressed events and logged data new event reporting rules for the idle node and instructing the idle node to change the event reporting rules for one or more components on the node.

Also stored in RAM (168) is an operating system (154). Operating systems useful for relevant alert delivery according to embodiments of the present invention include UNIX™ Linux™ Microsoft XP™ AIX™ IBM's i5/OS™ and others as will occur to those of skill in the art. The operating system (154), event and alert analysis module (124), the event analyzer (208), the alert analyzer (218) in the example of FIG. 2 are shown in RAM (168), but many components of such software typically are stored in non-volatile memory also, such as, for example, on a disk drive (170).

The computer (152) of FIG. 2 includes disk drive adapter (172) coupled through expansion bus (160) and bus adapter (158) to processor (156) and other components of the computer (152). Disk drive adapter (172) connects non-volatile data storage to the computer (152) in the form of disk drive (170). Disk drive adapters useful in computers for relevant alert delivery and dynamic administration of component event reporting according to embodiments of the present invention include Integrated Drive Electronics (‘IDE’) adapters, Small Computer System Interface (‘SCSI’) adapters, and others as will occur to those of skill in the art. Non-volatile computer memory also may be implemented for as an optical disk drive, electrically erasable programmable read-only memory (so-called ‘EEPROM’ or ‘Flash’ memory), RAM drives, and so on, as will occur to those of skill in the art.

The example computer (152) of FIG. 2 includes one or more input/output (‘I/O’) adapters (178). I/O adapters implement user-oriented input/output through, for example, software drivers and computer hardware for controlling output to display devices such as computer display screens, as well as user input from user input devices (181) such as keyboards and mice. The example computer (152) of FIG. 2 includes a video adapter (209), which is an example of an I/O adapter specially designed for graphic output to a display device (180) such as a display screen or computer monitor. Video adapter (209) is connected to processor (156) through a high speed video bus (164), bus adapter (158), and the front side bus (162), which is also a high speed bus.

The exemplary computer (152) of FIG. 2 includes a communications adapter (167) for data communications with other computers (182) and for data communications with a data communications network (100). Such data communications may be carried out serially through RS-232 connections, through external buses such as a Universal Serial Bus (USW), through data communications data communications networks such as IP data communications networks, and in other ways as will occur to those of skill in the art. Communications adapters implement the hardware level of data communications through which one computer sends data communications to another computer, directly or through a data communications network. Examples of communications adapters useful for relevant alert delivery and dynamic administration of component event reporting according to embodiments of the present invention include modems for wired dial-up communications, Ethernet (IEEE 802.3) adapters for wired data communications network communications, and 802.11 adapters for wireless data communications network communications.

For further explanation, FIG. 3 sets forth a block diagram of an exemplary system for relevant alert delivery and dynamic administration of component event reporting in a distributed processing system (102) according to embodiments of the present invention. The system of FIG. 3 includes an event and alert analysis module (124). The event and alert analysis module (124) of FIG. 3 receives in an event queue (206) a plurality of events (202) from one or more components of a distributed processing system (102). A component of a distributed processing system according to embodiments of the present invention may be a device of the distributed processing system or a process running on a device of the distributed processing. Many of such components are often capable of some form event transmission, often for error or status reporting. Such components often have installed upon them event reporting modules for reporting events in dependence upon event reporting rules for the individual component. Many of such event reporting rules may be, and often are, changeable and may be changed locally by the component in response to an instruction from an event and alert analysis module.

An event according to embodiments of the present invention is a notification of a particular occurrence in or on a component of the distributed processing system. Such events are sent from the component upon which the occurrence occurred or another reporting component to an event and alert analysis module according to the present invention. Often events are notifications of errors occurring in a component of the data processing system. Events are often implemented as messages either sent through a data communications network or shared memory. Typical events for event and alert analysis according to embodiments of the present invention an occurred time, a logged time, an event type, an event ID, a reporting component, and a source component, and other attributes. An occurred time is the time at which the event occurred on the component. A logged time is the time the event was included in the event queue (206) and is typically inserted into the event by the monitor (204) in the example of FIG. 3. An event type is a generic type of event such as for example, power error, link failure error, errors related to not receiving messages or dropping packets and so on as will occur to those of skill in the art. An event ID is a unique identification of the event. A reporting component is an identification of the component that reported the event. A source component is an identification of the component upon which the event occurred. In many cases, but not all, the reporting component and source component are the same component of the distributed processing system.

In the example of FIG. 3, the event and alert analysis module (124) includes a monitor (204) that receives events from components of the distributed processing system and puts the received events (202) in the event queue (206). The monitor (204) of FIG. 3 may receive events from components of the distributed processing system on their motion, may periodically poll one or more of the components of the distributed processing system, or receive events from components in other ways as will occur to those of skill in the art.

They system of FIG. 3 includes an event analyzer (208). The event analyzer (208) of FIG. 3 is a module of automated computing machinery capable of identifying alerts in dependence upon received events. That is, event analyzers typically receive events and produce alerts. In many embodiments, a plurality of event analyzers are implemented in parallel. Often event analyzers are assigned to a particular pool of events and may be focused on events from a particular component or caused by a particular occurrence to produce a more concise set of alerts.

The event analyzer (208) of FIG. 3 assigns each received event (202) to an events pool (212). An events pool (212) is a collection of events organized by the time of either their occurrence, by the time they are logged in the event queue, included in the events pool, or other time as will occur to those of skill in the art. That is, event pools are a collection of events organized by time. Such events pools often provide the ability to analyze a group of time related events identify alerts in dependence upon them. Often such event pools are useful in identifying fewer and more relevant alerts in dependence upon multiple related events.

An events pool according to the method of FIG. 3 has a predetermined initial period of time and in the example of FIG. 3 assigning by the event analyzer each received event to an events pool includes extending for each event assigned to the events pool the predetermined initial period of time by a particular period of time assigned to the event. In this manner, the pool is extended with each received event until a collection of events that may be usefully used to identify alerts is assigned to the events pool.

As mentioned above, in some embodiments of the present invention, more than one event analyzer may operate in parallel. As such, each event analyzer may maintain one or more event pools for relevant alert delivery according to embodiments of the present invention. Assigning by the event analyzer the events to an events pool may therefore include selecting only events from one or more particular components. In such embodiments, particular components may be selected for a particular events pool to provide events associated with a particular period of time from a particular set of one or more components.

Assigning by the event analyzer the events to an events pool may also be carried out by selecting only events of a particular event type. In such embodiments, particular events may be selected for a particular events pool to provide events associated with a particular period of time from a particular set of event types.

Event analyzer (208) in the example of FIG. 3 identifies in dependence upon the event analysis rules (210) and the events assigned to the events pool one or more alerts (214). Event analyses rules (210) are a collection of predetermined rules for meaningfully parsing received events to identify relevant alerts in dependence upon the events.

The event analysis rules (210) of FIG. 3 include event arrival rules (230), events pool operation rules (232), event suppression rules (234), and events pool closure rules (236). Event arrival rules (230) are configurable predetermined rules for identifying alerts in dependence upon events in real time as those events are assigned to the events pool. That is, event arrival rules (230) identify alerts in dependence upon events before closing the events pool. Such rules are typically predetermined to identify particular alerts in dependence upon attributes of those events. Event arrival rules may for example dictate identifying a particular predetermined alert for transmission to a systems administrator in dependence upon a particular event type or component type for the event or other attribute of that event. Such rules are flexible and may be tailored to a particular distributed computing system and its functions.

An alert according to embodiments of the present invention is refined identification of an occurrence—such and an error—based upon more than one event and therefore provides an identification of the occurrence in the context of its operation in the distributed processing system. Often an alert may be a notification of a particular error type of occurrence that is identified in dependence upon the plurality of events received from one or more components of the data processing system, such as, for example, a link failure among a plurality of devices each of which are producing many events based upon the single link failure, or a power failure provoking thousands of events, and so on.

Alerts are often implemented as messages to be sent through a data communications network or shared memory. Typical alerts according to embodiments of the present invention have attributes attached to them based upon the attributes of the events received from which they are identified.

Events pool operation rules (232) are configurable predetermined rules for controlling the operations of the events pool. Such rules includes rules identifying the initial predetermined period of time for each events pool, rules dictating the length of time extended to the pool upon the assignment of each new event to the pool, rules dictating the minimum time an event must be in a pool before that event is included in a collection of events when the pool is closed, rules governing the closing of an events pool, and others as will occur to those of skill in the art. Such rules are flexible and may be tailored to a particular distributed computing system and its functions.

Event suppression rules (234) are configurable predetermined rules for suppressing one or more events in a pool of events used in identifying alerts. That is, often events in the events pool may be duplicate events, redundant events, or otherwise unnecessary or unhelpful events in identifying alerts. Such suppression rules are typically predetermined to delete, drop, or otherwise ignore those suppressed events.

Event suppression rules may for example dictate that more than a threshold number of events of a particular event type or component type are to be suppressed. Such rules are also flexible and may be tailored to a particular distributed computing system and its functions.

Events pool closure rules (236) are configurable predetermined rules for identifying alerts in dependence upon unsuppressed events in the closed events pool and alerts identified by the event arrival rules. That is, events pool closure rules identify new alerts in dependence upon one or more or even all of the unsuppressed events in the closed events pool. The events pool closure rules also identify alerts in dependence upon the alerts identified by the event arrival rules (230) or a combination of the alerts identified by the event arrival rules (230) and one or more of the unsuppressed events in the closed events pool.

Event analyzer (208) in the example of FIG. 3 also may dynamically administer component event reporting by determining, in dependence upon the received events and one or more event analysis rules (210), to change the event reporting rules of one or more components and instructing, by the events analyzer, the one or more components to change the event reporting rules. The event analysis rules (210) of FIG. 3 include component reporting change rules including rules dictating the conditions under which an event analyzer will instruct one or more components of the distributed processing system to locally change its event reporting rules. Examples of such rules may include rules that instruct a component to locally suppress locally events of a particular type when too many redundant events of that type are being received or when the arrival rate of events are greater than a threshold rate, rules that instruct a component to report events of a particular type under particular conditions, rules that instruct a component to stop locally suppressing events of a particular type under particular conditions, rules that change the type of event being sent by the component under certain conditions and many others as will occur to those of skill in the art.

Event analyzer (208) in the example of FIG. 3 sends all the alerts (214) identified by the event analyzer (208) to an alert analyzer (218). The alert analyzer of FIG. 3 is a module of automated computing machinery capable of identifying alerts for transmission from events and other alerts, identifying additional alerts for transmission, and suppressing unnecessary, irrelevant, or otherwise unwanted or unhelpful alerts identified by the event analyzer. That is, alert analyzers typically receive alerts and events and produce or forward alerts in dependence upon those alerts and events. In many embodiments, a plurality of alert analyzers are implemented in parallel. The alerts (216) in the example of FIG. 3 are sent from event analyzer (208) to an alert analyzer (218) through an alerts queue (216).

The alert analyzer (218) of FIG. 3 assigns each of the identified alerts (214) to an alerts pool (224). An alerts pool (224) is a collection of alerts organized by the time of one or more the events causing the alert to be identified, the time the alert is identified, or other time as will occur to those of skill in the art. That is, alerts pools are a collection of alerts organized by time. Such alerts pools often provide the ability to analyze a group of alerts identified and included in the alerts pool according to some time. Often such alerts pools are useful in identifying fewer and more relevant alerts in dependence upon multiple related events and multiple related alerts.

The alert analyzer may assign the identified alerts to an alerts pool (224) in dependence upon attributes of the alerts or attributes of the events from which those alerts were identified. For example, the alert analyzer of FIG. 3 may assign alerts to the alerts pool (224) by selecting alerts generated from events from one or more particular components, alerts associated with a particular alert type and so on as will occur to those of skill in the art.

The alert analyzer (218) of FIG. 3 determines in dependence upon alert analysis rules (222) and the alerts in the alert pool whether to suppress any alerts. Suppressing an alert is typically carried out by dropping the alert, deleting the alert or otherwise ignoring or not transmitting the suppressed alert to a component of the distributed processing system.

Alert analyses rules (222) are a collection of rules for suppressing one or more alerts to provide a more relevant set of alerts for transmission to a component of the distributed processing system, such as for example, for display to a systems administrator and to identify additional alerts for transmission to one or more components of the distributed processing system. Alert analysis rules for example may dictate that duplicate alerts are to be suppressed, alerts of a particular type for transmission to a particular component are to be suppressed, alerts of a particular type be transmitted to a particular component are to be suppressed and so on as will occur to those of skill in the art. Such alerts may be more meaningful to a component of the distributed processing system for automated error recovery or for a systems administrator who may otherwise be less informed by a number of raw unanalyzed alerts.

The alert analyzer (218) of FIG. 3 also has access to the events queue (206). The alert analyzer (218) of FIG. 3 in dependence upon the alert analysis rules may, in some embodiments select events from the events queue and determine whether to suppress any alerts in dependence upon the selected events. That is, alert analysis rules may also take into account events and their attributes for suppressing alerts and for identifying additional alerts for transmission to one or more components. Such events may be related to the alerts in the alerts pool or independent from such alerts.

The alert analyzer (218) of FIG. 3 transmits the unsuppressed alerts to one or more components of the distributed processing system. The alert analyzer may transmit the unsuppressed alerts to one or more components of the distributed processing system by sending the alert as a message across a data communications network, through shared memory, or in other ways as will occur to those of skill in the art. In the example of FIG. 3, the unsuppressed alerts (220) are transmitted to a terminal (122) for display to a systems administrator (128).

The alert analyzer (218) of FIG. 3 is also capable of identifying in dependence upon alert analysis rules (222), the alerts in the alert pool (224), and selected events (206) one or more additional alerts and transmitting the one or more components of the distributed processing system. The additional alerts may include one or more alerts not identified by the event analyzer. Such additional alerts may provide additional information to a component of the distributed processing system of a systems administrator.

One or more of the components on one or more of the nodes of the distributed processing system (102) of FIG. 3 includes an event reporting module (800). The event reporting module is capable of administering event reporting rules in a distributed processing system by identifying that a node upon which the component is stored of the distributed processing system is idle; collecting by the idle node any suppressed events and logged data from the node; sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data. Changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data may be carried out by the event analyzer that identifies new event reporting rules for the idle node and instructs the idle node to change the event reporting rules for one or more components on the node.

As mentioned above, relevant alert delivery and dynamic administration of component event reporting according to the present invention includes assigning events to an event pool. For further explanation, FIG. 4 sets forth a diagram illustrating assigning events to an event pool according to embodiments of the present invention. An events pool (212) is a collection of events organized by the time of either their occurrence, by the time they are logged in the event queue, included in the events pool, or other time as will occur to those of skill in the art. That is, event pools are a collection of events organized by time. Such events pools often provide the ability to analyze a group of time related events and to identify alerts in dependence upon them. Often such event pools are useful in identifying fewer and more relevant alerts in dependence upon multiple related events.

Events pools according to embodiments of the present invention are typically operated according to events pool operation rules which are themselves often included in event analysis rules. Such events pool operation rules are configurable predetermined rules for controlling the operations of the events pool. Such rules includes rules identifying the initial predetermined period of time for each events pool, rules dictating the length of time extended to the pool upon the assignment of each new event to the pool, rules dictating the minimum time an event must be in a pool before that event is included in a collection of events when the pool is closed, rules governing the closing of an events pool, and others as will occur to those of skill in the art. Such rules are flexible and may be tailored to a particular distributed computing system and its functions.

Events are often assigned to an events pool according to their logged time. That is, events are typically inserted into the events pool in the order that they are received in the event queue. In the example of FIG. 4, the timing of the events pool (212) is initiated when the first event ‘Event 0’ (402) is assigned to the events pool (212) at time t₀. The events pool of FIG. 4 is initiated for a predetermined initial period of time from t₁ to t_(f). That is, upon receiving the first event ‘Event 0’ (402) the events pool of FIG. 4 has a predetermined initial period of time beginning at t₁ and ending at t_(f). The predetermined initial period of time may be configured in dependence upon a number of factors as will occur to those of skill in the art such as, the number of components in the distributed processing system, the frequency of receiving events, the types of events typically received and so on as will occur to those of skill in the art.

In the example FIG. 4, the initial period of time is extended for each new event assigned to the events pool during the predetermined initial period from t₁ to t_(f) by a particular period of time assigned to the event. In the example of FIG. 4 upon assigning ‘Event 1’ (402) to the events pool (212) the predetermined initial period of time t₀−t_(f) is extended by ‘Extension 1’ (406) having a time of e1 thereby creating a new time for closing the events pool (212) at t_(f+e1) if no other events are assigned to the pool before t_(f+e1). Similarly, in the example of FIG. 4 upon assigning ‘Event 2’ (404) to the events pool having a time of e2, the now extended period of time from t₀−t_(f+e1) is extended again by extension 2 (406) thereby establishing a new time for closing the pool at time t_(f+e1+e2) if no other events are assigned to the pool before t_(f+e1+e2) or before some maximum time for the events pool has expired. In this manner, the event pool is extended with each received event until a collection of events that may be usefully used to identify alerts is assigned to the events pool.

In typical embodiments of the present invention, event pools may have a maximum duration that can no longer be extended. In such cases, a requirement may exist that an event that has not resided in the event pool for a threshold period of time be moved to a next events pool. In some embodiments, the attributes of such an event that is moved to the next events pool are used for relevant alert delivery according to embodiments of the present invention with the initial events pool and in other embodiments, the attributes of such an event are used for relevant alert delivery with the next events pool to which that event is moved.

In many embodiments, a plurality of events pools may be used in parallel and one or more of such events pools are assigned to a particular events analyzer. In such embodiments, events analyzers may be directed to events in events pools having particular attributes.

As mentioned above, relevant alert delivery and dynamic administration of component event reporting according to the present invention also includes assigning alerts to an alerts pool. For further explanation, FIG. 5 sets forth a diagram illustrating assigning alerts to an alert pool according to embodiments of the present invention. The alerts pool (224) of FIG. 5 operates in a manner similar to the events pool of FIG. 4. That is, the alerts pool according to the example of FIG. 5 includes alerts and the timing of the alerts pool begins with the first alert ‘Alert 0’ (500) at time t₀ and is configured to have a predetermined initial period of time t₀−tf. In the example of FIG. 5, the initial period of time is extended for each new alert assigned to the alerts pool in the predetermined initial period from t₁ to t_(f) by a particular period of time assigned to the alert. In the example of FIG. 5, upon assigning ‘Alert 1’ (502) to the alerts pool (224) the predetermined initial period of time t₀−t_(f) is extended by ‘Extension 1’ (506) having a time of e1 thereby creating a new time for closing the alerts pool (224) at t_(f+e1) if no other alerts are assigned to the pool before t_(f+e1). Similarly, in the example of FIG. 4 upon assigning ‘Alert 2’ (504) to the alerts pool having a time of e2, the now extended period of time from t₀−t_(f+e1) is extended again by ‘Extension 2’ (406) thereby establishing a new time for closing the pool at time t_(f+e1+e2) if no other alerts are assigned to the pool before t_(f+e1+e2) or before some maximum time for the alerts pool has expired.

In typical embodiments of the present invention, alerts pools may have a maximum duration that can no longer be extended. In such cases, a requirement may exist that an alert that has not resided in the alert pool for a threshold period of time be moved to a next alerts pool. In some embodiments, the attributes of such an alert that is moved to the next alerts pool are used for relevant alert delivery according to embodiments of the present invention with the initial alerts pool and in other embodiments, the attributes of such an alert are used for relevant alert delivery with the next alerts pool to which that alert is moved.

In many embodiments, a plurality of alerts pools may be used in parallel and one or more of such alerts pools are assigned to a particular alerts analyzer. In such embodiments, alerts analyzers may be directed to alerts in alerts pools having particular attributes.

For further explanation, FIG. 6 sets forth a flow chart illustrating an example method of relevant alert delivery with event and alert suppression in a distributed processing system according to embodiments of the present invention. The method of FIG. 6 includes receiving (402) in an event queue a plurality of events (202) from one or more components of a distributed processing system. Events useful in relevant alert delivery with event and alert suppression according to embodiments of the present invention may include an occurred time, a logged time, an event type, an event ID, a reporting component, and a source component.

Receiving (402) in an event queue a plurality of events (202) from one or more components of a distributed processing system may be carried out by receiving an event initiated by one or more components of the data processing system and storing the event in the event queue according to the time in which the event occurred or according to the time the event was received. Receiving (402) in an event queue a plurality of events (202) from one or more components of a distributed processing system also may be carried out by polling a component for status and receiving in response an event and storing the event in the event queue according to the time in which the event occurred or according to the time the event was received.

The method of FIG. 6 also includes assigning (404) by an event analyzer each received event to an events pool (212). In some embodiments of the present invention, assigning (404) by an event analyzer each received event (202) to an events pool (212) may be carried out by assigning events to the event pool according to the logged time. Assigning (404) by an event analyzer each received event (202) to an events pool (212) may also be carried out in dependence upon attributes of the event. Such attributes may include an identification or type of the component upon which an occurrence occurred to create the event, the reporting component of the event, the event ID, the event type, and so on as will occur to those of skill in the art.

An events pool according to the method of FIG. 6 includes events occurring during a predetermined initial period of time and in the example of FIG. 6 assigning (404) by the event analyzer each received event to an events pool includes extending (426) for each event assigned to the events pool the predetermined initial period of time by a particular period of time assigned to the event.

The event analyzer includes event analysis rules (210) including, event arrival rules, events pool operation rules, event suppression rules, and events pool closure rules. Event arrival rules are configurable predetermined rules for identifying alerts in dependence upon events in real time as those events are assigned to the events pool. That is, event arrival rules identify alerts in dependence upon events before closing the events pool. Such rules are flexible and may be tailored to a particular distributed computing system and its functions.

An alert according to embodiments of the present invention is refined identification of an occurrence—such and an error—based upon more than one event and therefore provides an identification of the occurrence in the context of its operation in the distributed processing system. Often an alert may be a notification of a particular error type of occurrence that is identified in dependence upon the plurality of events received from one or more components of the data processing system, such as, for example, a link failure among a plurality of devices each of which are producing many events based upon the single link failure, or a power failure provoking thousands of events, and so on.

Alerts are often implemented as messages to be sent through a data communications network or shared memory. Typical alerts according to embodiments of the present invention have attributes attached to them based upon the attributes of the events received from which they are identified.

Events pool operation rules are configurable predetermined rules for controlling the operations of the events pool. Such rules includes rules identifying the initial predetermined period of time for each events pool, rules dictating the length of time extended to the pool upon the assignment of each new event to the pool, rules dictating the minimum time an event must be in a pool before that event is included in a collection of events when the pool is closed, rules governing the closing of an events pool, and others as will occur to those of skill in the art. Such rules are flexible and may be tailored to a particular distributed computing system and its functions.

Event suppression rules are configurable predetermined rules for suppressing one or more events in a closed pool of events used in identifying alerts. That is, often events in the closed events pool may be duplicate events, redundant events, or otherwise unnecessary or unhelpful events in identifying alerts. Such suppression rules are typically predetermined to delete, drop, or otherwise ignore those suppressed events. Event suppression rules may for example dictate that more than a threshold number of events of a particular event type or component type are to be suppressed. Such rules are also flexible and may be tailored to a particular distributed computing system and its functions.

Events pool closure rules are configurable predetermined rules for identifying alerts in dependence upon unsuppressed events in the closed events pool and alerts identified by the event arrival rules. That is, events pool closure rules identify new alerts in dependence upon one or more or even all of the unsuppressed events in the closed events pool. The events pool closure rules also identify alerts in dependence upon the alerts identified by the event arrival rules or a combination of the alerts identified by the event arrival rules and one or more of the unsuppressed events in the closed events pool.

The method of FIG. 6 also includes identifying (410) by the event analyzer in dependence upon the event arrival rules and the events assigned to the events pool one or more alerts (214). Identifying (410) by the event analyzer in dependence upon the event arrival rules and the events assigned to the events pool one or more alerts (214) may be carried out by identifying alerts in dependence upon one or more attributes of the events as that event is assigned to the events pool. Identifying (410) by the event analyzer in dependence upon the event arrival rules and the events assigned to the events pool one or more alerts (214) may be carried by comparing the attributes of the events to the event arrival rules and identifying as a result of the comparison one or more alerts. Such attributes may include the type of component from which the event was received, the type of component creating the event, the identification of the component creating the event, the time the event was created or received, an error reported in the event, and many others as will occur to those of skill in the art.

The method of FIG. 6 also includes closing (412), by the event analyzer in dependence upon the events pool operation rules, the events pool (212). Closing (412), by the event analyzer in dependence upon the events pool operation rules, the events pool (212) may be carried out by determining that conditions dictated by the events pool operation rules have been met to stop assigning new events to the events pool and identifying in dependence upon those events pool operation rules the particular events that are included in the closed pool of events.

Closing the events pool may be carried out by determining that the initial period of time for the events pool and any particular periods of time for events received in the events pool extended to the initial period of time have expired. In such cases, if no new events are received prior to the expiration of the initial period of time for the events pool and any particular periods of time for events received in the events pool extended to the initial period of time the pool is closed.

Closing the events pool may also be carried out by determining that a maximum duration for the events pool has expired. In such cases, regardless of the number of new events being received after a maximum duration for the events pool has expired the pool is closed. In such embodiments, a maximum duration for the events pool prevents the events pool from including more events than are useful for relevant alert delivery according to embodiments of the present invention.

The method of FIG. 6 also includes determining (414), by the events analyzer in dependence upon the event suppression rules, whether to suppress one or more events in the closed events pool (212). Determining (414), by the events analyzer in dependence upon the event suppression rules, whether to suppress one or more events in the closed events pool (212) may be carried out by determining in dependence upon the attributes of one or more events in the closed pool whether to delete, drop, or otherwise ignore one or more of the events in the closed pool.

The method of FIG. 6 includes identifying (416) by the event analyzer in dependence upon the events pool closure rules and any unsuppressed events assigned to the events pool, one or more additional alerts (417). Identifying (416) by the event analyzer in dependence upon the events pool closure rules and any unsuppressed events assigned to the events pool, one or more additional alerts (417) may be carried out by identifying alerts in dependence upon one or more attributes of the events as that event is assigned to the events pool. Identifying (416) by the event analyzer in dependence upon the events pool closure rules and any unsuppressed events assigned to the events pool, one or more additional alerts (417) may be carried out by selecting the unsuppressed events for the events pool, comparing the attributes of the unsuppressed events of the events pool to the pool closure rules, and identifying as a result of the comparison one or more additional alerts. Such attributes may include the type of component from which one or more of the unsuppressed events are received, the type of components creating the unsuppressed events, the identification of the component creating the unsuppressed events, the time the events were created or received, one or more errors reported by the events event, the number of events in the pool, and many others as will occur to those of skill in the art.

The method of FIG. 6 includes sending (418) by the event analyzer to an alert analyzer all the alerts identified by the event analyzer. Sending (418) by the event analyzer to an alert analyzer all the alerts (214) identified by the event analyzer may be carried out by sending a message containing the alerts from the event analyzer to the alert analyzer. Such a message may be sent from the event analyzer to the alert analyzer across a network, through shared memory, or in other ways as will occur to those of skill in the art.

The method of FIG. 6 includes assigning (420) by the alert analyzer the identified alerts to an alerts pool (224). An alerts pool according to the method of FIG. 6 has a predetermined initial period of time and in the example of FIG. 6 assigning (420) by the alert analyzer the identified alerts to an alerts pool (224) includes extending for each alert assigned to the alerts pool the predetermined initial period of time by a particular period of time assigned to the alert. Assigning (420) by the alert analyzer the identified alerts to an alerts pool (224) also may be carried out in dependence upon attributes of the alerts. Such attributes may include an identification or type of the component upon which an occurrence occurred to create the event that was used to identify the alert, the alert ID, the alert type, and so on as will occur to those of skill in the art.

The method of FIG. 6 includes determining (422) by the alert analyzer in dependence upon alert analysis rules (222) and the alerts in the alert pool whether to suppress any alerts. Determining (422) by the alert analyzer in dependence upon alert analysis rules (222) and the alerts in the alert pool whether to suppress any alerts may be carried out in dependence upon one or more attributes of the alerts. Such attributes may include an identification or type of the component upon which an occurrence occurred to create the event that was used to identify the alert, the alert ID, the alert type, and so on as will occur to those of skill in the art. In such embodiments, determining (422) by the alert analyzer in dependence upon alert analysis rules (222) and the alerts in the alert pool whether to suppress any alerts may be carried out by comparing the attributes of the alerts in the alerts pool to the alert analysis rules and identifying as a result of the comparison one or more alerts for suppression according to the event analysis rules.

The method of FIG. 6 includes transmitting (420) the unsuppressed alerts to one or more components of the distributed processing system. Transmitting (420) the unsuppressed alerts to one or more components of the distributed processing system may be carried out by sending a message containing the alert to one or more components of the distributed processing system. In many cases, an alert may be sent as a message to a systems administrator advising the systems administrator of one or more occurrences within the distributed processing system.

As mentioned above, alert analysis rules may select additional alerts or suppress alerts in dependence upon events. In such embodiments, determining whether to suppress any alerts includes selecting events and determining whether to suppress any alerts in dependence upon the selected events. The method of FIG. 6 therefore also includes identifying (426) by the alert analyzer in dependence upon alert analysis rules (222), the alerts in the alert pool (224), and any selected events one or more additional alerts and in the method of FIG. 6, transmitting (428) the unsuppressed alerts also includes transmitting (430) any additional alerts to one or more components of the distributed processing system.

In certain situations in a distributed processing system, it may be beneficial to dynamically administer the event reporting of one or more components of the distributed processing system at the component itself rather than suppressing an event or changing the event received in an event and alert analysis module. For further explanation, therefore, FIG. 7 sets forth a flow chart illustrating an example method of dynamic administration of component event reporting in a distributed processing system according to embodiments of the present invention. The method of FIG. 7 includes receiving (802), by an events analyzer from an events queue (206), a plurality of events (202) from one or more components of the distributed processing system. Receiving (802), by an events analyzer from an events queue (206), a plurality of events (202) from one or more components of the distributed processing system may be carried out by receiving an event initiated by one or more components of the data processing system and storing the event in the event queue, polling a component for status and receiving in response an event and storing the event in the event queue, or in other ways as will occur to those of skill in the art. As mentioned above, events are often implemented as messages that may be transmitted through a data communications network, shared memory, or in other ways as will occur to those of skill in the art.

The method of FIG. 7 includes assigning (804), by the event analyzer, one or of the events an events pool (212). Assigning (804), by the event analyzer, one or of the events an events pool (212) may be carried out as described above.

The method of FIG. 7 includes determining (806), by the events analyzer in dependence upon the received events and one or more event analysis rules (210), to change the event reporting rules of one or more components. As mentioned, events analysis rules according to some embodiments of the present invention include component reporting change rules that including rules dictating the conditions under which an event analyzer will instruct one or more components of the distributed processing system to locally change its event reporting rules. Examples of such rules may include rules that instruct a component to locally suppress events of a particular type when too many redundant events of that type are being received or when the arrival rate of events is greater than a threshold rate, rules that instruct a component to report events of a particular type under particular conditions, rules that instruct a component to stop locally suppressing events of a particular type under particular conditions, rules that change the type of event being sent by the component under certain conditions and many others as will occur to those of skill in the art.

Determining (806), by the events analyzer in dependence upon the received events and one or more event analysis rules (210), to change the event reporting rules of one or more components may be carried out by comparing the number of or attributes of one or more events in the events pool with the event analysis rules and identifying that the number of or attributes of the events conform to a rule to change the event reporting rules of one or more components of the distributed processing system.

The method of FIG. 7 includes instructing (808), by the events analyzer, the one or more components to change the event reporting rules. Instructing (808), by the events analyzer, the one or more components to change the event reporting rules may include instructing the component to suppress events of a particular event type, instructing the component to delay sending events for a particular period of time, instructing the component to suppress events for a particular duration of time, instructing the component to discontinue suppressing events of a particular event type, instructing the component to change the type of event reported under certain conditions, and so on as will occur to those of skill in the art.

Instructing (808), by the events analyzer, the one or more components to change the event reporting rules may be carried out by sending a message to the one or more components with an instruction to change the event reporting of the one or more components. In some embodiments, the component may receive such a message and change the event reporting rules locally from one predetermined event reporting rule to another predetermined event reporting rule. In other embodiments, an event analyzer may send in the message a new event reporting rule to be installed locally on the component.

In the example of FIG. 7, events are assigned to an events pool prior to determining to change the event reporting rules of one or more components. In alternative embodiments, however, an events analyzer may determine that an event reporting rule is be changed in dependence upon an event without assigning that event to the events pool. In such embodiments, one or more events are compared with event analysis rules before being assigned to the events pool to determine whether to instruct one or more components to change their event reporting rules.

The method of FIG. 7 includes receiving (812), by the one or more components, the instruction to change the event reporting rules. Receiving (812), by the one or more components, the instruction to change the event reporting rules may be carried out by receiving a message to change the reporting rules locally on the one or more components through a data communications network, shared memory, or in other ways as will occur to those of skill in the art.

The method of FIG. 7 also includes changing (814), by the one or more components, the event reporting rules in accordance with the instruction. In some embodiments, changing (814), by the one or more components, the event reporting rules in accordance with the instruction may include locally changing from one already installed predetermined event reporting rule to another already installed predetermined event reporting rule. In some other embodiments, changing (814), by the one or more components, the event reporting rules in accordance with the instruction may be carried out by receiving from the events analyzer a new event reporting rule, installing the event reporting rule locally, and using the rule to report events under certain conditions.

As mentioned above, one example condition under which an events analyzer may instruct one or more components to change event reporting rules may include receiving from one or more components events that exceed a particular arrival rate. For further explanation, therefore, FIG. 8 sets forth a flow chart illustrating an additional method of dynamic administration of component event reporting in a distributed processing system according to embodiments of the present invention. The method of FIG. 8 is similar to the method of FIG. 7 in that the method of FIG. 8 includes receiving (802), by an events analyzer from an events queue (206), a plurality of events (202) from one or more components of the distributed processing system; assigning (804), by the event analyzer, one or of the events an events pool (212); determining (806), by the events analyzer in dependence upon the received events and one or more event analysis rules (210), to change the event reporting rules of one or more components; instructing (808), by the events analyzer, the one or more components to change the event reporting rules; receiving (812), by the one or more components, the instruction to change the event reporting rules; and changing (814), by the one or more components, the event reporting rules in accordance with the instruction.

The method of FIG. 8 differs from the method of FIG. 7 in that in the method of FIG. 7 determining (806), by the events analyzer in dependence upon the received events and one or more events analysis rules, to change the event reporting rules of one or more components includes determining (820) whether an arrival rate of one or events of a particular event type from one or more components of the distributed processing system is greater than a predetermined threshold (816). Determining (820) whether an arrival rate of one or events of a particular event type from one or more components of the distributed processing system is greater than a predetermined threshold (816) may be carried out by calculating an arrival rate for a particular type of events from particular components and comparing the calculated arrival rate with the predetermined threshold (816).

As mentioned above, another example condition under which an events analyzer may instruct one or more components to change event reporting rules may include receiving from one or more components events that exceed a particular threshold number for such events. FIG. 9 sets forth a flow chart illustrating an additional method of dynamic administration of component event reporting in a distributed processing system according to embodiments of the present invention. The method of FIG. 9 is similar to the method of FIGS. 7 and 8 in that the method of FIG. 9 includes receiving (802), by an events analyzer from an events queue (206), a plurality of events (202) from one or more components of the distributed processing system; assigning (804), by the event analyzer, one or of the events an events pool (212); determining (806), by the events analyzer in dependence upon the received events and one or more event analysis rules (210), to change the event reporting rules of one or more components; instructing (808), by the events analyzer, the one or more components to change the event reporting rules; receiving (812), by the one or more components, the instruction to change the event reporting rules; and changing (814), by the one or more components, the event reporting rules in accordance with the instruction.

The method of FIG. 9 differs from the method of FIGS. 7 and 8 in that in the method of FIG. 7 determining (806) in dependence upon one or more of the events in the events pool to change the event reporting rules of the one or more components determining (822) that a threshold number (818) of events of a particular kind are assigned to the events pool. Determining (820) that a threshold number of events of a particular kind are assigned to the events pool may be carried out by counting the number of events of a particular kind in the events pool and comparing the events with the threshold (818).

For further explanation, FIG. 10 sets forth a flow chart illustrating a method of administering event reporting rules in a distributed processing system according to embodiments of the present invention. The method of FIG. 10 includes identifying (902) that one or more nodes of the distributed processing system (102) is idle. An idle node is a node that is no longer performing its usual computing duties as a result of experiencing an update, a failure, or other condition as will occur to those of skill in the art. Identifying (902) that one or more nodes of the distributed processing system (902) is idle may be carried out by identifying a node undergoing a rolling update. A rolling update is an update to a compute node that occurs serially or in groups among the compute nodes of the distributed processing system rather than by updating each node at the same time. A rolling update reduces the effect of the update as often the majority of the compute nodes during the rolling update are not idle. Identifying a node undergoing a rolling update may be carried out by identifying a node ID in an update list that identifies a node currently undergoing an update, receiving a message in an event analyzer or other module identifying an event currently undergoing an update and in other ways as will occur to those of skill in the art.

In another embodiments, identifying (902) that one or more nodes of the distributed processing system (902) is idle may be carried out by identifying a node that has failed. Identifying a node that has failed may be carried out by receiving in an event analyzer an event identifying that the node has failed because either one or more of the components of the node has failed or experienced an error classified as a failure such that the node is caused to become idle for at least a period of time.

For each identified idle node, the method of FIG. 10 includes collecting (904) by the idle node any suppressed events (906) and logged data (908) from the node. Collecting (904) by the idle node any suppressed events (906) and logged data (908) from the node may be carried out by retrieving from an error log or other data store on one or more components of the node suppressed events, that is, created events that were not transmitted to an event analyzer because of event reporting rules or other rules, log data identifying types and times of failures or errors, types and times of suppressed events and other events and logged data as will occur to those of skill in the art.

In some embodiments, collecting (904) by the idle node any suppressed events (906) and logged data (908) from the node may be carried out by in response to an instruction from an event analyzer. In such cases, an event analyzer is made aware that the node is idle and instructs the node to collect and send the unsuppressed events and logged data. In some alternative embodiments, collecting (904) by the idle node any suppressed events (906) and logged data (908) from the node may be carried out by the idle node in response to identifying that the node is idle without instruction from another component of the distributed processing system. In such embodiments, upon identifying that the node is idle the node own its own motion collects and sends the unsuppressed events and logged data.

The method of FIG. 10 also includes sending (910) the suppressed events (906) and logged data (908) to a database (912) of events. Sending (910) the suppressed events (906) and logged data (908) to a database (912) of events may be carried out by packetizing the events and logged data and sending the events and logged data to a monitor of an event and alert analysis module or other component of the distributed processing system through a network, shared memory, or in other ways as will occur to those of skill in the art.

The method of FIG. 10 also includes determining (914) in dependence upon the suppressed events (906) and logged data (908) to change the event reporting rules for one or more components of the identified idle node. Determining (914) in dependence upon the suppressed events (906) and logged data (908) to change the event reporting rules for one or more components of the identified idle node may be carried out comparing the suppressed events, logged data, and contextual data such as the components creating the suppressed events, time of occurrence and so on with component reporting change rules that include rules dictating the conditions under which an event analyzer will instruct one or more components of the distributed processing system to locally change its event reporting rules.

The method of FIG. 10 also includes changing (916) the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events (906) and the logged data (908). Changing (916) the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events (906) and the logged data (908) may be carried out by discontinuing to suppress one or more events of one or more event types, changing the events reported in response to conditions experienced by one or more components of the idle node and in other ways as will occur to one of skill in the art.

Changing (916) the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events (906) and the logged data (908) according to the method of FIG. 10 includes identifying (918) by an events analyzer new event reporting rules for the idle node and instructing (922) by the events analyzer the idle node to change the event reporting rules for one or more components on the node. Identifying (918) by an events analyzer new event reporting rules for the idle node may be carried out by comparing the suppressed events, logged data, and contextual data such as the components creating the suppressed events, time of occurrence and so on with component reporting change rules to select new event reporting rules for the idle node. Instructing (922) by the events analyzer the idle node to change the event reporting rules for one or more components on the node may be carried out by sending a message to the one or more components of the node with an instruction to change the event reporting of the one or more components of the node. In some embodiments, the component may receive such a message and change the event reporting rules locally from one predetermined event reporting rule to another predetermined event reporting rule. In other embodiments, an event analyzer may send in the message a new event reporting rule to be installed locally on the component.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims. 

1. A method of administering event reporting rules in a distributed processing system, the method comprising: identifying that one or more nodes of the distributed processing system is idle; for each identified idle node, collecting by the idle node any suppressed events and logged data from the node; and sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data.
 2. The method of claim 1 wherein identifying that one or more nodes of the distributed processing system is idle further comprises identifying a node undergoing a rolling update.
 3. The method of claim 1 wherein identifying that one or more nodes of the distributed processing system is idle further comprises identifying a node that has failed.
 4. The method of claim 1 wherein changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data further comprises identifying by an events analyzer new event reporting rules for the idle node and instructing by the events analyzer the idle node to change the event reporting rules for one or more components on the node.
 5. The method of claim 1 wherein changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data further comprises discontinuing to suppress one or more events of one or more event types.
 6. The method of claim 1 wherein collecting by the idle node any suppressed events and logged data from the node is carried out in response to an instruction from an event analyzer.
 7. The method of claim 1 wherein collecting by the idle node any suppressed events and logged data from the node is carried out by the idle node in response to identifying that the node is idle without instruction from another component of the distributed processing system.
 8. A system for administering event reporting rules in a distributed processing system, the system comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions capable, when executed by the computer processor, of causing the system to carry out the steps of: identifying that one or more nodes of the distributed processing system is idle; for each identified idle node, collecting by the idle node any suppressed events and logged data from the node; and sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data.
 9. The system of claim 8 wherein identifying that one or more nodes of the distributed processing system is idle further comprises identifying a node undergoing a rolling update.
 10. The system of claim 8 wherein identifying that one or more nodes of the distributed processing system is idle further comprises identifying a node that has failed.
 11. The system of claim 8 wherein changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data further comprises identifying by an events analyzer new event reporting rules for the idle node and instructing by the events analyzer the idle node to change the event reporting rules for one or more components on the node.
 12. The system of claim 8 wherein changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data further comprises discontinuing to suppress one or more events of one or more event types.
 13. The system of claim 8 wherein collecting by the idle node any suppressed events and logged data from the node is carried out in response to an instruction from an event analyzer.
 14. The system of claim 8 wherein collecting by the idle node any suppressed events and logged data from the node is carried out by the idle node in response to identifying that the node is idle without instruction from another component of the distributed processing system.
 15. A computer program product for administering event reporting rules in a distributed processing system, the computer program product disposed upon a computer readable medium, the computer program product comprising computer program instructions for: identifying that one or more nodes of the distributed processing system is idle; for each identified idle node, collecting by the idle node any suppressed events and logged data from the node; and sending the suppressed events and logged data to a database of events; and changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data.
 16. The computer program product of claim 15 wherein identifying that one or more nodes of the distributed processing system is idle further comprises identifying a node undergoing a rolling update.
 17. The computer program product of claim 15 wherein identifying that one or more nodes of the distributed processing system is idle further comprises identifying a node that has failed.
 18. The computer program product of claim 15 wherein changing the event reporting rules for one or more components on the identified idle node in dependence upon the suppressed events and the logged data further comprises identifying by an events analyzer new event reporting rules for the idle node and instructing by the events analyzer the idle node to change the event reporting rules for one or more components on the node.
 19. The computer program product of claim 15 wherein the computer readable medium comprises a storage medium.
 20. The computer program product of claim 15 wherein the computer readable medium comprises a signal medium. 